The Many Worlds of Modal {\lambda}-calculi: I. Curry-Howard for Necessity, Possibility and Time

نویسنده

  • G. A. Kavvos
چکیده

Preface 2

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Thesis Proposal: Type Theory for Mobility and Locality

In this thesis, we consider distributed programming from a type-theoretic, logical perspective. We develop a calculus for distributed programming based on a constructive modal logic. Through a Curry-Howard interpretation of proof terms as programs and propositions as types, we show that logical necessity is connected to mobility, and possibility to remote locality. We give an operational interp...

متن کامل

Logical Mobility and Locality Types

We present a type theory characterizing the mobility and locality of program terms in a calculus for distributed computation. The type theory is derived from logical notions of necessity (2A) and possibility (3A) of the modal logic S4 via a Curry-Howard style isomorphism. Logical worlds are interpreted as sites for computation, accessibility corresponds to dependency between processes at those ...

متن کامل

Disjunctive Axioms and Concurrent $\lambda$-Calculi: a Curry-Howard Approach

We add to intuitionistic logic infinitely many classical disjunctive tautologies and use the Curry–Howard correspondence to obtain typed concurrent λ-calculi; each of them features a specific communication mechanism, including broadcasting and cyclic messageexchange, and enhanced expressive power w.r.t. the λ-calculus. Moreover they all implement forms of code mobility. Our results provide a fi...

متن کامل

Curry-Howard Term Calculi for Gentzen-Style Classical Logics

This thesis is concerned with the extension of the Curry-Howard Correspondence to classical logic. Although much progress has been made in this area since the seminal paper by Griffin, we believe that the question of finding canonical calculi corresponding to classical logics has not yet been resolved. We examine computational interpretations of classical logics which we keep as close as possib...

متن کامل

Tableaux for the Logic of Proofs

The Logic of Proofs, LP, is an explicit provability logic due to Artemov. The introduction of LP answered a long-standing question concerning the intended semantics of Gödel’s provability calculus and provability semantics for intuitionistic logic. The explicit nature of LP and its ability to naturally represent both modal logic and typed λcalculi, especially in light of the Curry-Howard Isomor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016